Robertson–Seymour theorem - PDFSEARCH.IO - Document Search Engine

Robertson–Seymour theorem
Results: 32

#	Item
11	First Section Flavors of Rigidity Flavor IV - Reconstructing Discrete Networks University of Pittsburgh Add to Reading List Source URL: www.math.cornell.edu Language: English - Date: 2015-01-22 09:08:15 Forbidden graph characterization Configurations Planar graphs Graph coloring Möbius–Kantor graph Graph theory Robertson–Seymour theorem Bipartite graph
12	AN ALGORITHM FOR DETECTING INTRINSICALLY KNOTTED GRAPHS arXiv:1109.1030v2 [math.GT] 9 OctJONATHAN MILLER AND RAMIN NAIMI Add to Reading List Source URL: arxiv.org Language: English - Date: 2013-10-09 21:48:19 Linkless embedding Graph embedding Robertson–Seymour theorem Minor Chordal graph Complete graph Petersen family Planar graphs Graph theory Topological graph theory Knot theory
13	Algorithmic Implications of the Graph Minor Theorem∗ Daniel Bienstock Dept. of Civil Engineering Columbia University Add to Reading List Source URL: web.eecs.utk.edu Language: English - Date: 2003-10-15 21:13:20 Robertson–Seymour theorem Path decomposition Tree decomposition Planar graph Intersection graph Clique Graph property Chordal graph Graph structure theorem Graph theory Graph operations Minor
14	Contraction Bidimensionality: the Accurate Picture⋆ Fedor V. Fomin1 , Petr Golovach1 , and Dimitrios M. Thilikos2 1 2 Add to Reading List Source URL: drops.dagstuhl.de Language: English - Date: 2010-03-02 04:30:56 Minor Path decomposition Tree decomposition Bidimensionality Edge contraction Clique-sum Robertson–Seymour theorem Apex graph Planar graph Graph theory Theoretical computer science Graph operations
15	THEOREM OF THE DAY Wagner’s Theorem A graph G is planar if and only if it contains neither K5 nor K3,3 as a graph minor. The graph above left is the famous Petersen graph. Its nonplanarity can be confirmed by Kuratowsk Add to Reading List Source URL: www.theoremoftheday.org Language: English - Date: 2014-02-07 05:07:17 Planar graph Robertson–Seymour theorem Klaus Wagner Graph Graph coloring Forbidden graph characterization Snark Graph theory Minor Petersen graph
16	ARTICLE IN PRESS Journal of Computer and System Sciences[removed]–91 http://www.elsevier.com/locate/jcss Constant time parallel sorting: an empirical view Add to Reading List Source URL: www.cs.umd.edu Language: English - Date: 2004-09-15 12:26:58 Analysis of algorithms Probabilistic complexity theory Randomized algorithm Graph Matching Time complexity Expander graph Robertson–Seymour theorem Trapezoid graph Theoretical computer science Graph theory Mathematics
17	The Computational Complexity Column by Lance FORTNOW NEC Research Institute Add to Reading List Source URL: www.cs.umd.edu Language: English - Date: 2001-01-24 15:44:35 Analysis of algorithms Probabilistic complexity theory Randomized algorithm Matching Probabilistic method Petersen graph Robertson–Seymour theorem Graph coloring Graph theory Mathematics Theoretical computer science
18	Holographic Algorithms with Matchgates Capture Precisely Tractable Planar #CSP Jin-Yi Cai∗ Pinyan Lu† Add to Reading List Source URL: pages.cs.wisc.edu Language: English - Date: 2010-07-10 15:34:42 Combinatorial optimization Matching Planar graph Structure Vertex cover Holographic algorithm Tutte polynomial Robertson–Seymour theorem Graph theory Mathematics Theoretical computer science
19	Linear-time algorithms for Monadic Logic Steven Lindell Haverford College, Department of Computer Science Add to Reading List Source URL: www.haverford.edu Language: English - Date: 2012-03-28 11:42:22 Logic Mathematical structures Graph theory First-order logic Predicate logic Monad Structure Graph Robertson–Seymour theorem Mathematics Mathematical logic Model theory